Chess Revision Acquiring the Rules of Chess Variants through FOL Theory Revision from Examples.

HTILDE scaling up relational decision trees for very large databases.

Using the bottom clause and mode declarations in FOL theory revision from examples.

Advances in Artificial Intelligence %2D SBIA 2008

Genetic local search for rule learning.

Combining attributes to improve the performance of Naive Bayes for Regression.

Using the Bottom Clause and Mode Declarations on FOL Theory Revision from Examples.

Improved natural crossover operators in GBIVIL.

Applying REC Analysis to Ensembles of Particle Filters.

Applying REC Analysis to Ensembles of Particle Filters.

Revising First%2DOrder Logic Theories from Examples Through Stochastic Local Search.

Improving model construction of profile HMMs for remote homology detection through structural alignment.

A study of structural properties on profiles HMMs

Using Regression Error Characteristic Curves for Model Selection in Ensembles of Neural Networks.

Using Regression Error Characteristic Curves for Model Selection in Ensembles of Neural Networks.

Genetic Based Machine Learning Merging Pittsburgh and Michigan

PFORTE Revising Probabilistic FOL Theories.

Applying REC Analysis to Ensembles of Sigma%2DPoint Kalman Filters.

ILP Through Propositionalization and Stochastic k%2DTerm DNF Learning.
ILP has been successfully applied to a variety of tasks. Nevertheless, ILP systems have huge time and storage requirements, owing to a large search space of possible clauses. Therefore, clever search strategies are needed. One promising family of search strategies is that of stochastic local search methods. These methods have been successfully applied to propositional tasks, such as satisfiability, substantially improving their efficiency. Following the success of such methods, a promising research direction is to employ stochastic local search within ILP, to accelerate the runtime of the learning process. An investigation in that direction was recently performed within ILP [  ˇ Zelezn´y et al., 2004]. Stochastic local search algorithms for propositional satisfiability benefit from the ability to quickly test whether a truth assignment satisfies a formula. As a result, many possible solutions (assignments) can be tested and scored in a short time. In contrast, the analogous test within ILP—testing whether a clause covers an example—takes much longer, so that far fewer possible solutions can be tested in the same time. Therefore, motivated by both the sucess and limitations of the previous work, we also apply stochastic local search to ILP but in a different manner. Instead of directly applying stochastic local search to the space of firstorder Horn clauses, we use a propositionalization approach that transforms the ILP task into an attribute-value learning task. In this alternative search space, we can take advantage of fast testing as in propositional satisfiability. Our primary aim in this paper is to reduce ILP run-time. The standard greedy covering algorithm employed by most ILP systems is another shortcoming of typical ILP search. There is no guarantee that greedy covering will yield the globally optimal hypothesis; consequently, greedy covering often gives rise to problems such as unnecessarily long hypothesis with too
Probabilistic First%2DOrder Theory Revision from Examples.

A Partitioning Method for Fuzzy Probabilistic Predictors.

Improving the Performance of the RISE Algorithm.
Abstract. Ideally, a multi-strategy learning algorithm performs better than its component approaches. RISE is a multi-strategy algorithm that combines rule induction and instance-based learning. It achieves higher accuracy than some state-of-the-art learning algorithms, but for large data sets it has a very high average running time. This work presents the analysis and experimental evaluation of SUNRISE, a new multi-strategy learning algorithm based on RISE. The SUNRISE algorithm was developed to be faster than RISE with similar accuracy. Comparing the results of the experimental evaluation of the two algorithms, it could be verified that the new algorithm achieves comparable accuracy to that of the RISE algorithm but in a lower average running time. 1
Search%2DBased Class Discretization for Hidden Markov Model for Regression.

A Distribution Design Methodology for Object DBMS.

Applying Theory Revision to the Design of Distributed Databases.
This work presents the application of theory revision to the design of distributed databases to automatically revise a heuristic-based algorithm (called analysis algorithm) through the use of the FORTE system. The analysis algorithm decides the fragmentation technique to be used in each class of the database and its Prolog implementation is provided as the initial domain theory. Fragmentation schemas...
Towards a Theory Revision Approach for the Vertical Fragmentation of Object Oriented Databases.

Fuzzy Markov Predictor with First and Second%2DOrder Dependences.

A Framework for the Design of Distributed Databases.
This work presents the application of theory revision to the design of distributed databases to automatically revise a heuristic-based algorithm (called analysis algorithm) through the use of the FORTE system. The analysis algorithm decides the fragmentation technique to be used in each class of the database and its Prolog implementation is provided as the initial domain theory. Fragmentation schemas...
Fuzzy Bayes and Fuzzy Markov Predictors.

Learning Logic Programs with Neural Networks.

Object Oriented Design Expertise Reuse An Approach Based on Heuristics
. Object Oriented (OO) languages do not guarantee that a system is
The Connectionist Inductive Learning and Logic Programming System.
The Connectionist Inductive Learning and Logic Programming System, C-IL  2  P, integrates the symbolic and connectionist paradigms of Artificial Intelligence through neural networks that perform massively parallel Logic Programming and inductive learning from examples and background knowledge. This work presents an extension of C-IL  2  P that allows the implementation of Extended Logic Programs in Neural Networks. This extension makes C-IL  2  P applicable to problems where the background knowledge is represented in a Default Logic. As a case example, we have applied the system for fault diagnosis of a simplified power system generation plant, obtaining good preliminary results.
Towards an Inductive Design of Distributed Object Oriented Databases.
Cooperative Information Systems (CIS) often consist of applications that access shared resources such as databases. Since centralized systems may have a great impact on the system performance, parallel and distribution techniques are need for attaining scalability. Distributed databases are, then, crucial for the development of cooperative applications. However, in order to improve performance, it is very important to design information distribution properly, which is the goal of Distribution Design. Considering the various difficulties embedded in the Design of Distributed Object Oriented Databases, this work presents an algorithm to assist distribution designers in their task. The analysis algorithm indicates the most adequate fragmentation technique (vertical, horizontal or mixed) for each class in the database schema, and we propose the use of a machine learning method - Inductive Logic Programming - to uncover some implicit issues to be considered in the distribution design, thus ...
Towards a Hybrid Model of First%2DOrder Theory Refinement.

A Penalty%2DFunction Approach to Rule Extraction from Knowledge%2DBased Neural Networks.

Inducing Relational Concepts with Neural Networks via the LINUS System.
This paper presents a method to induce relational concepts with neural networks using the inductive logic programming system LINUS. Some first-order inductive learning tasks taken from machine learning literature were applied successfully, thus confirming the quality of the hypothesis generated by neural networks.
Normal Programs and Multiple Predicate Learning.

A Goal Directed Reasoning for Semi%2DNormal Default Theories.

A Prioritized Contextual Default Logic Curing Anomalous Extensions with a Simple Abnormality Default Theory.

Logical Foundations of a Modal Defeasible Relevant Logic of Belief.

Relevant logic as a basis for paraconsistent epistemic logics.

